A Denotational Definition of the Semantics of DRC, A Domain Relational Calculus
نویسندگان
چکیده
This paper presents a semi-formal denotational definition of the semantics of a version of domain relational calculus called DRC. A single basic design principle governs the semantic definition: each predicate (or formula) of DRC denotes a relation. The definition obtained is precise, short, and systematic. Generalizations of operations of the relational algebra are suggested, which correspond very directly with the semantics of DRC formulas. This work also suggests a more active role of semantic considerations in the design process of a query language, in order to simplify the specification of the language and, eventually , the language itself.
منابع مشابه
A duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملA Denotational Semantics for the π-Calculus
In his categorical framework, Stark defines a domain-theoretic model for the π-calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark’s denotational model for the π-calculus and provide a full definition of the semantic domains...
متن کاملWell Constructed Workflows in Bioinformatics
We demonstrate and discuss the advantages of bioinformatical workflows which have no side-effects over those which do have them. In particular, we describe a method to give a formal, mathematical semantics to the side-effect-free workflows defined in SCUFL, the workflow definition language of Taverna. This is achieved by translating them into a natural extension of the Nested Relational Calculu...
متن کاملRevisiting Elementary Denotational Semantics
We present a semantics for an applied call-by-value λ-calculus that is compositional, extensional, and elementary. We present four dierent views of the semantics: 1) as a relational (big-step) semantics that is not operational but instead declarative, 2) as a denotational semantics that does not use domain theory, 3) as a non-deterministic interpreter, and 4) as a variant of the intersection t...
متن کاملDi erential Linear Logic and Polarization
We extend Ehrhard Regnier's di erential linear logic along the lines of Laurent's polarization. We provide a denotational semantics of this new system in the well-known relational model of linear logic, extending canonically the semantics of both di erential and polarized linear logics: this justi es our choice of cut elimination rules. Then we show this polarized di erential linear logic re ne...
متن کامل